Recovery guarantees for Internet applications
نویسندگان
چکیده
منابع مشابه
Recovery Guarantees for General Multi-Tier Applications
Database recovery does not mask failures to applications and users. Recovery is needed that considers data, messages, and application components. Special cases have been studied, but clear principles for recovery guarantees in general multi-tier applications such as web-based e-services are missing. We develop a framework for recovery guarantees that masks almost all failures. The main concept ...
متن کاملAccuracy Guarantees for ℓ1-Recovery
We discuss two new methods of recovery of sparse signals from noisy observation based on `1minimization. They are closely related to the well-known techniques such as Lasso and Dantzig Selector. However, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the estimators which posse...
متن کاملPerformance Guarantees for Cluster-Based Internet Services
As web-based transactions become an essential element of everyday corporate and commerce activities, it becomes increasingly important that the performance of web-based services be predictable and guaranteed even in the presence of wildly fluctuating input loads. In this paper, we propose a general implementation framework to provide quality of service (QoS) guarantee for cluster-based Internet...
متن کاملAccuracy guarantees for l 1 - recovery ∗
We discuss two new methods of recovery of sparse signals from noisy observation based on l1minimization. While they are closely related to the well-known techniques such as Lasso and Dantzig Selector, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the estimators which possess ...
متن کاملRecovery guarantees for exemplar-based clustering
For a certain class of distributions, we prove that the linear programming relaxation of kmedoids clustering—a variant of k-means clustering where means are replaced by exemplars from within the dataset—distinguishes points drawn from nonoverlapping balls with high probability once the number of points drawn and the separation distance between any two balls are sufficiently large. Our results h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Internet Technology
سال: 2004
ISSN: 1533-5399,1557-6051
DOI: 10.1145/1013202.1013205